A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
نویسندگان
چکیده
منابع مشابه
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold graphs by a finite set of forbidden subgraphs: the class of weakly quasi-threshold graphs coincides with the class of {P4, co-(2P3)}-free graphs. Moreover we give the first linear-time algorithm to decide whether a given...
متن کاملLaplacian Spectrum of Weakly Quasi-threshold Graphs
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) adding a new vertex and making it adjacent to all old vertices, (iii) disjoint union of two old graphs, and (iv) adding a new vertex and making it adjacent to all neighbours of an old vertex. This class contains the class...
متن کاملA Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
In this paper we consider the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added. This problem originated from the Perfect Phylogeny problem from molecular biology, and is strongly related with the problem of recognizing partial k-trees. In this paper we give a simple linear time algorithm that solves the pro...
متن کاملA simple linear time algorithm for cograph recognition
In this paper, we describe a new simple linear time algorithm to recognize cographs. Cographs are exactly the P4-free graphs (where P4 denotes the path with 4 vertices). The recognition process works in two steps. First, we use partition refinement techniques to produce a factorizing permutation, i.e., an ordering of the vertices in which the strong modules appear consecutively. Then a very sim...
متن کاملA linear time recognition algorithm for proper interval graphs
We propose a linear time recognition algorithm for proper interval graphs. The algorithm is based on certain ordering of vertices, called bicompatible elimination ordering (BCO). Given a BCO of a biconnected proper interval graph G, we also propose a linear time algorithm to construct a Hamiltonian cycle of G.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2010
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-010-0983-0